Criteria of Divergence Almost Everywhere in Ergodic Theory
نویسندگان
چکیده
منابع مشابه
Criteria of Divergence Almost Everywhere in Ergodic Theory
In this expository paper, we survey nowadays classical tools or criteria used in problems of convergence everywhere to build counterexamples: the Stein continuity principle, Bourgain’s entropy criteria and Kakutani-Rochlin lemma, most classical device for these questions in ergodic theory. First, we state a L-version of the continuity principle and give an example of its usefulness by applying ...
متن کاملA converse to linear independence criteria, valid almost everywhere
We prove a weighted analogue of the Khintchine–Groshev Theorem, where the distance to the nearest integer is replaced by the absolute value. This is subsequently applied to proving the optimality of several linear independence criteria over the field of rational numbers.
متن کاملAlmost everywhere equivalence of logics in finite model theory
We introduce a new framework for classifying logics on finite structures and studying their expressive power. This framework is based on the concept of almost everywhere equivalence of logics, that is to say, two logics having the same expressive power on a class of asymptotic measure 1. More precisely, if L, L0 are two logics and ì is an asymptotic measure on finite structures, then L a.e. L0 ...
متن کاملIncentive Compatibility: Everywhere vs. Almost Everywhere∗
A risk neutral buyer observes a private signal s ∈ [a, b], which informs her that the mean and variance of a normally distributed risky asset are s and σ s respectively. She then sets a price at which to acquire the asset owned by risk averse “outsiders”. Assume σ s ∈ { 0, σ } for some σ > 0 and let B = { s ∈ [a, b] | σ s = 0 } . If B = ∅, then there exists a fully revealing equilibrium in whic...
متن کاملAlmost-Everywhere Secure Computation
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network has very large connectivity — in fact, , where is the number of potential corruptions in the network. This impossibility result renders existing MPC results far less applicable in practice, since many deployed network...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Sciences
سال: 2016
ISSN: 1072-3374,1573-8795
DOI: 10.1007/s10958-016-3137-y